Combinatorially Regular Polyomino Tilings

نویسندگان

  • James W. Cannon
  • William J. Floyd
  • Walter R. Parry
چکیده

Let T be a regular tiling of R which has the origin 0 as a vertex, and suppose that φ : R → R is a homeomorphism such that i) φ(0) = 0, ii) the image under φ of each tile of T is a union of tiles of T , and iii) the images under φ of any two tiles of T are equivalent by an orientation-preserving isometry which takes vertices to vertices. It is proved here that there is a subset Λ of the vertices of T such that Λ is a lattice and φ|Λ is a group homomorphism. The tiling φ(T ) is a tiling of R by polyiamonds, polyominos, or polyhexes. These tilings occur often as expansion complexes of finite subdivision rules. The above theorem is instrumental in determining when the tiling φ(T ) is conjugate to a self-similar tiling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parallelogram tile fills the plane by translation in at most two distinct ways

We consider the tilings by translation of a single polyomino or tile on the square grid Z. It is well-known that there are two regular tilings of the plane, namely, parallelogram and hexagonal tilings. Although there exist tiles admitting an arbitrary number of distinct hexagon tilings, it has been conjectured that no polyomino admits more than two distinct parallogram tilings. In this paper, w...

متن کامل

An Optimal Algorithm for Tiling the Plane with a Translated Polyomino

We give aO(n)-time algorithm for determining whether translations of a polyomino with n edges can tile the plane. The algorithm is also a O(n)-time algorithm for enumerating all regular tilings, and we prove that at most Θ(n) such tilings exist.

متن کامل

Complexity of cutting words on regular tilings

We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed by 2p horizontal and 2q vertical unit segments.

متن کامل

Polyominoes simulating arbitrary-neighborhood zippers and tilings

This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice, on the other side. A neighborhood N is a finite set of pairs (i, j) ∈ Z, indicating that the neighbors of a position (x, y) are the positions (x + i, y + j) for (i, j) ∈ N . This includes classical neighborhoods of si...

متن کامل

Rigid Tilings of Quadrants by L-Shaped n-ominoes and Notched Rectangles

In this paper, we examine rigid tilings of the four quadrants in a Cartesian coordinate system by tiling sets consisting of L-shaped polyominoes and notched rectangles. The first tiling sets we consider consist of an L-shaped polyomino and a notched rectangle, appearing from the dissection of an n×n square, and of their symmetries about the first diagonal. In this case, a tiling of a quadrant i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2006